Information geometry approach to parameter estimation in Markov chains
نویسندگان
چکیده
منابع مشابه
Information Geometry Approach to Parameter Estimation in Hidden Markov Models
We consider the estimation of hidden Markovian process by using information geometry with respect to transition matrices. We consider the case when we use only the histogram of k-memory data. Firstly, we focus on a partial observation model with Markovian process and we show that the asymptotic estimation error of this model is given as the inverse of projective Fisher information of transition...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملRecursive Parameter Estimation for Partially Observed Markov Chains
Using the reference probability method, a recursive equation is obtained for the unnormalized joint conditional density of a noisily observed Markov chain, and parameters which determine the transition densities and coefficients in the observations.
متن کاملThe exponential family of Markov chains and its information geometry
We introduce a new definiton of exponential family of Markov chains, and show that many characteristic properties of the usual exponential family of probability distributions are properly extended to Markov chains. The method of information geometry is effectively applied to our framework, which enables us to characterize the divergence rate of Markov chain from a differential geometric viewpoi...
متن کاملParameter estimation: A new approach to weighting a priori information
We propose a new approach to weighting initial parameter misfits in a least squares optimization problem for linear parameter estimation. Parameter misfit weights are found by solving an optimization problem which ensures the penalty function has the properties of a χ random variable with n degrees of freedom, where n is the number of data. This approach differs from others in that weights foun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2016
ISSN: 0090-5364
DOI: 10.1214/15-aos1420